Parallel dynamic load balancing strategies for adaptive irregular applications
نویسندگان
چکیده
منابع مشابه
Dynamic Load Balancing Strategies for Parallel Computers
This paper deals with the problem of load balancing of parallel applications. Based on the study of recent work in the area, we propose a general taxonomy for describing and classifying the growing number of different load balancing techniques. This gives a thorough overview of different algorithms, helping designers to compare and choose the most suitable strategy for a given application. To i...
متن کاملBalancing CPU Load for Irregular MPI Applications
MPI applications typically are designed to be run on a parallel machine with one process per core. If processes exhibit different computational load, either the code must be rewritten for load balancing, with negative side-effects on readability and maintainability, or the one-process-per-core philosophy leads to a low utilization of many processor cores. If several processes are mapped per cor...
متن کاملPractical Dynamic Load Balancing for Irregular Problems
In this paper, we present a cohesive, practical load balancing framework that addresses many shortcomings of existing strategies. These techniques are portable to a broad range of prevalent architec-tures, including massively parallel machines such as the Cray T3D and Intel Paragon, shared memory systems such as the SGI Power Challenge, and networks of workstations. This scheme improves on earl...
متن کاملDynamic Load Balancing for Parallel
Adaptive mesh reenement is a key problem in large-scale numerical calculations. The need of adaptive mesh reenement could introduce load imbalance among processors, where the load measures the amount of work required by reenement itself as well as by numerical calculations thereafter. We present a dynamic load balancing algorithm to ensure that the work load are balanced while the communication...
متن کاملDynamic Load Balancing for Parallel Adaptive Mesh Refinement
A key step in the nite element method is to generate a high quality mesh that is as small as possible for an input domain. Several meshing methods and heuristics have been developed and implemented. Methods based on advancing front, Delaunay triangulations, and quadtrees/octrees are among the most popular ones. Advancing front uses simple data structures and is eecient. Unfortunately, in genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2000
ISSN: 0307-904X
DOI: 10.1016/s0307-904x(00)00040-8